0.04/0.12 % Problem : SLH538^1 : TPTP v7.5.0. Released v7.5.0. 0.13/0.13 % Command : run_E %s %d THM 0.13/0.34 % Computer : n014.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 30 0.13/0.34 % WCLimit : 30 0.13/0.34 % DateTime : Tue Aug 9 03:11:16 EDT 2022 0.13/0.34 % CPUTime : 0.20/0.47 The problem SPC is TH0_THM_EQU_NAR 0.20/0.47 Running higher-order on 1 cores theorem proving 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.20/0.47 # Version: 3.0pre003-ho 0.47/0.69 # Preprocessing class: HSLSSMSSSSSCHSA. 0.47/0.69 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.47/0.69 # Starting new_ho_10 with 30s (1) cores 0.47/0.69 # new_ho_10 with pid 16531 completed with status 0 0.47/0.69 # Result found by new_ho_10 0.47/0.69 # Preprocessing class: HSLSSMSSSSSCHSA. 0.47/0.69 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.47/0.69 # Starting new_ho_10 with 30s (1) cores 0.47/0.69 # No SInE strategy applied 0.47/0.69 # Search class: HGHSM-FSLM32-MHSFFFBN 0.47/0.69 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.47/0.69 # Starting sh3 with 17s (1) cores 0.47/0.69 # sh3 with pid 16532 completed with status 0 0.47/0.69 # Result found by sh3 0.47/0.69 # Preprocessing class: HSLSSMSSSSSCHSA. 0.47/0.69 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.47/0.69 # Starting new_ho_10 with 30s (1) cores 0.47/0.69 # No SInE strategy applied 0.47/0.69 # Search class: HGHSM-FSLM32-MHSFFFBN 0.47/0.69 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.47/0.69 # Starting sh3 with 17s (1) cores 0.47/0.69 # Preprocessing time : 0.010 s 0.47/0.69 # Presaturation interreduction done 0.47/0.69 0.47/0.69 # Proof found! 0.47/0.69 # SZS status Theorem 0.47/0.69 # SZS output start CNFRefutation 0.47/0.69 thf(decl_22, type, plus_plus_int: int > int > int). 0.47/0.69 thf(decl_23, type, plus_plus_nat: nat > nat > nat). 0.47/0.69 thf(decl_24, type, zero_zero_int: int). 0.47/0.69 thf(decl_25, type, zero_zero_nat: nat). 0.47/0.69 thf(decl_26, type, if_nat: $o > nat > nat > nat). 0.47/0.69 thf(decl_27, type, sublist_list_nat: list_nat > list_nat > list_nat). 0.47/0.69 thf(decl_28, type, sublist_list_a: list_a > list_nat > list_a). 0.47/0.69 thf(decl_29, type, sublist_list_if_nat: list_nat > list_nat > list_nat). 0.47/0.69 thf(decl_30, type, sublist_list_if_a: list_a > list_nat > list_a). 0.47/0.69 thf(decl_31, type, listIn1299132951ke_nat: nat > (nat > nat) > list_nat). 0.47/0.69 thf(decl_32, type, listIn84854903take_a: nat > (nat > a) > list_a). 0.47/0.69 thf(decl_33, type, append_nat: list_nat > list_nat > list_nat). 0.47/0.69 thf(decl_34, type, append_a: list_a > list_a > list_a). 0.47/0.69 thf(decl_35, type, bind_nat_nat: list_nat > (nat > list_nat) > list_nat). 0.47/0.69 thf(decl_36, type, count_list_nat: list_nat > nat > nat). 0.47/0.69 thf(decl_37, type, nil_nat: list_nat). 0.47/0.69 thf(decl_38, type, nil_a: list_a). 0.47/0.69 thf(decl_39, type, map_nat_nat: (nat > nat) > list_nat > list_nat). 0.47/0.69 thf(decl_40, type, map_nat_a: (nat > a) > list_nat > list_a). 0.47/0.69 thf(decl_41, type, map_a_nat: (a > nat) > list_a > list_nat). 0.47/0.69 thf(decl_42, type, map_a_a: (a > a) > list_a > list_a). 0.47/0.69 thf(decl_43, type, size_list_nat: (nat > nat) > list_nat > nat). 0.47/0.69 thf(decl_44, type, size_list_a: (a > nat) > list_a > nat). 0.47/0.69 thf(decl_45, type, list_ex1_nat: (nat > $o) > list_nat > $o). 0.47/0.69 thf(decl_46, type, map_tailrec_nat_nat: (nat > nat) > list_nat > list_nat). 0.47/0.69 thf(decl_47, type, map_tailrec_nat_a: (nat > a) > list_nat > list_a). 0.47/0.69 thf(decl_48, type, map_tailrec_a_nat: (a > nat) > list_a > list_nat). 0.47/0.69 thf(decl_49, type, map_tailrec_a_a: (a > a) > list_a > list_a). 0.47/0.69 thf(decl_50, type, take_nat: nat > list_nat > list_nat). 0.47/0.69 thf(decl_51, type, upt: nat > nat > list_nat). 0.47/0.69 thf(decl_52, type, semiri2019852685at_int: nat > int). 0.47/0.69 thf(decl_53, type, semiri1382578993at_nat: nat > nat). 0.47/0.69 thf(decl_54, type, ord_less_int: int > int > $o). 0.47/0.69 thf(decl_55, type, ord_less_nat: nat > nat > $o). 0.47/0.69 thf(decl_56, type, ord_less_eq_int: int > int > $o). 0.47/0.69 thf(decl_57, type, ord_less_eq_nat: nat > nat > $o). 0.47/0.69 thf(decl_58, type, order_Greatest_int: (int > $o) > int). 0.47/0.69 thf(decl_59, type, order_Greatest_nat: (nat > $o) > nat). 0.47/0.69 thf(decl_60, type, f: nat > a). 0.47/0.69 thf(decl_61, type, m: nat). 0.47/0.69 thf(decl_62, type, n: nat). 0.47/0.69 thf(decl_63, type, esk1_2: (nat > a) > (nat > a) > nat). 0.47/0.69 thf(decl_64, type, esk2_4: list_a > list_a > (a > a) > list_a > list_a). 0.47/0.69 thf(decl_65, type, esk3_4: list_a > list_a > (a > a) > list_a > list_a). 0.47/0.69 thf(decl_66, type, esk4_4: list_nat > list_nat > (a > nat) > list_a > list_a). 0.47/0.69 thf(decl_67, type, esk5_4: list_nat > list_nat > (a > nat) > list_a > list_a). 0.47/0.69 thf(decl_68, type, esk6_4: list_nat > list_nat > (nat > nat) > list_nat > list_nat). 0.47/0.69 thf(decl_69, type, esk7_4: list_nat > list_nat > (nat > nat) > list_nat > list_nat). 0.47/0.69 thf(decl_70, type, esk8_4: list_a > list_a > (nat > a) > list_nat > list_nat). 0.47/0.69 thf(decl_71, type, esk9_4: list_a > list_a > (nat > a) > list_nat > list_nat). 0.47/0.69 thf(decl_72, type, esk10_4: (a > a) > list_a > list_a > list_a > list_a). 0.47/0.69 thf(decl_73, type, esk11_4: (a > a) > list_a > list_a > list_a > list_a). 0.47/0.69 thf(decl_74, type, esk12_4: (a > nat) > list_a > list_nat > list_nat > list_a). 0.47/0.69 thf(decl_75, type, esk13_4: (a > nat) > list_a > list_nat > list_nat > list_a). 0.47/0.69 thf(decl_76, type, esk14_4: (nat > nat) > list_nat > list_nat > list_nat > list_nat). 0.47/0.69 thf(decl_77, type, esk15_4: (nat > nat) > list_nat > list_nat > list_nat > list_nat). 0.47/0.69 thf(decl_78, type, esk16_4: (nat > a) > list_nat > list_a > list_a > list_nat). 0.47/0.69 thf(decl_79, type, esk17_4: (nat > a) > list_nat > list_a > list_a > list_nat). 0.47/0.69 thf(decl_80, type, esk18_4: list_a > list_a > list_a > list_a > list_a). 0.47/0.69 thf(decl_81, type, esk19_4: list_a > list_a > list_a > list_a > list_a). 0.47/0.69 thf(decl_82, type, esk20_4: list_nat > list_nat > list_nat > list_nat > list_nat). 0.47/0.69 thf(decl_83, type, esk21_4: list_nat > list_nat > list_nat > list_nat > list_nat). 0.47/0.69 thf(decl_84, type, esk22_1: (nat > nat > $o) > nat). 0.47/0.69 thf(decl_85, type, esk23_1: (nat > nat > $o) > nat). 0.47/0.69 thf(decl_86, type, esk24_1: (nat > nat > $o) > nat). 0.47/0.69 thf(decl_87, type, esk25_1: (nat > nat > $o) > nat). 0.47/0.69 thf(decl_88, type, esk26_1: (int > int > $o) > int). 0.47/0.69 thf(decl_89, type, esk27_1: (int > int > $o) > int). 0.47/0.69 thf(decl_90, type, esk28_1: (int > int > $o) > int). 0.47/0.69 thf(decl_91, type, esk29_1: (int > int > $o) > int). 0.47/0.69 thf(decl_92, type, esk30_4: nat > nat > (nat > nat) > nat > nat). 0.47/0.69 thf(decl_93, type, esk31_4: nat > nat > (nat > nat) > nat > nat). 0.47/0.69 thf(decl_94, type, esk32_4: nat > nat > (nat > int) > int > nat). 0.47/0.69 thf(decl_95, type, esk33_4: nat > nat > (nat > int) > int > nat). 0.47/0.69 thf(decl_96, type, esk34_4: int > int > (int > nat) > nat > int). 0.47/0.69 thf(decl_97, type, esk35_4: int > int > (int > nat) > nat > int). 0.47/0.69 thf(decl_98, type, esk36_4: int > int > (int > int) > int > int). 0.47/0.69 thf(decl_99, type, esk37_4: int > int > (int > int) > int > int). 0.47/0.69 thf(decl_100, type, esk38_4: nat > (nat > nat) > nat > nat > nat). 0.47/0.69 thf(decl_101, type, esk39_4: nat > (nat > nat) > nat > nat > nat). 0.47/0.69 thf(decl_102, type, esk40_4: int > (nat > int) > nat > nat > nat). 0.47/0.69 thf(decl_103, type, esk41_4: int > (nat > int) > nat > nat > nat). 0.47/0.69 thf(decl_104, type, esk42_4: nat > (int > nat) > int > int > int). 0.47/0.69 thf(decl_105, type, esk43_4: nat > (int > nat) > int > int > int). 0.47/0.69 thf(decl_106, type, esk44_4: int > (int > int) > int > int > int). 0.47/0.69 thf(decl_107, type, esk45_4: int > (int > int) > int > int > int). 0.47/0.69 thf(decl_108, type, esk46_4: nat > nat > (nat > nat) > nat > nat). 0.47/0.69 thf(decl_109, type, esk47_4: nat > nat > (nat > nat) > nat > nat). 0.47/0.69 thf(decl_110, type, esk48_4: nat > nat > (nat > int) > int > nat). 0.47/0.69 thf(decl_111, type, esk49_4: nat > nat > (nat > int) > int > nat). 0.47/0.69 thf(decl_112, type, esk50_4: int > int > (int > nat) > nat > int). 0.47/0.69 thf(decl_113, type, esk51_4: int > int > (int > nat) > nat > int). 0.47/0.69 thf(decl_114, type, esk52_4: int > int > (int > int) > int > int). 0.47/0.69 thf(decl_115, type, esk53_4: int > int > (int > int) > int > int). 0.47/0.69 thf(decl_116, type, esk54_4: nat > (nat > nat) > nat > nat > nat). 0.47/0.69 thf(decl_117, type, esk55_4: nat > (nat > nat) > nat > nat > nat). 0.47/0.69 thf(decl_118, type, esk56_4: nat > (int > nat) > int > int > int). 0.47/0.69 thf(decl_119, type, esk57_4: nat > (int > nat) > int > int > int). 0.47/0.69 thf(decl_120, type, esk58_4: int > (nat > int) > nat > nat > nat). 0.47/0.69 thf(decl_121, type, esk59_4: int > (nat > int) > nat > nat > nat). 0.47/0.69 thf(decl_122, type, esk60_4: int > (int > int) > int > int > int). 0.47/0.69 thf(decl_123, type, esk61_4: int > (int > int) > int > int > int). 0.47/0.69 thf(decl_124, type, esk62_2: (nat > $o) > nat > nat). 0.47/0.69 thf(decl_125, type, esk63_1: (nat > $o) > nat). 0.47/0.69 thf(decl_126, type, esk64_2: (int > $o) > int > int). 0.47/0.69 thf(decl_127, type, esk65_2: (nat > $o) > nat > nat). 0.47/0.69 thf(decl_128, type, esk66_2: (int > $o) > int > int). 0.47/0.69 thf(decl_129, type, esk67_3: (int > $o) > int > (int > $o) > int). 0.47/0.69 thf(decl_130, type, esk68_2: (nat > $o) > nat > nat). 0.47/0.69 thf(decl_131, type, esk69_3: (nat > $o) > nat > (nat > $o) > nat). 0.47/0.69 thf(decl_132, type, esk70_2: (nat > $o) > nat > nat). 0.47/0.69 thf(decl_133, type, esk71_3: (nat > $o) > nat > nat > nat). 0.47/0.69 thf(decl_134, type, esk72_2: (nat > $o) > nat > nat). 0.47/0.69 thf(decl_135, type, esk73_2: nat > nat > nat). 0.47/0.69 thf(decl_136, type, esk74_2: nat > nat > nat). 0.47/0.69 thf(decl_137, type, esk75_2: nat > nat > nat). 0.47/0.69 thf(decl_138, type, esk76_2: nat > nat > nat). 0.47/0.69 thf(decl_139, type, esk77_1: (nat > nat > $o) > nat). 0.47/0.69 thf(decl_140, type, esk78_1: (nat > nat > $o) > nat). 0.47/0.69 thf(decl_141, type, esk79_1: (nat > nat > $o) > nat). 0.47/0.69 thf(decl_142, type, esk80_1: (nat > nat > $o) > nat). 0.47/0.69 thf(decl_143, type, esk81_1: (nat > nat > $o) > nat). 0.47/0.69 thf(decl_144, type, esk82_1: (nat > $o) > nat). 0.47/0.69 thf(decl_145, type, esk83_1: (nat > nat) > nat). 0.47/0.69 thf(decl_146, type, esk84_1: (nat > nat) > nat). 0.47/0.69 thf(fact_24_i__take__def, axiom, ((listIn84854903take_a)=(^[X5:nat, X3:nat > a]:(map_nat_a @ X3 @ (upt @ zero_zero_nat @ X5)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_24_i__take__def)). 0.47/0.69 thf(fact_4_map__append, axiom, ![X13:nat > a, X14:list_nat, X15:list_nat]:(((map_nat_a @ X13 @ (append_nat @ X14 @ X15))=(append_a @ (map_nat_a @ X13 @ X14) @ (map_nat_a @ X13 @ X15)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_4_map__append)). 0.47/0.69 thf(conj_1, conjecture, ((append_a @ (listIn84854903take_a @ m @ f) @ (map_nat_a @ f @ (upt @ m @ n)))=(listIn84854903take_a @ n @ f)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_1)). 0.47/0.69 thf(fact_94_upt__append, axiom, ![X252:nat, X76:nat]:(((ord_less_eq_nat @ X252 @ X76)=>((append_nat @ (upt @ zero_zero_nat @ X252) @ (upt @ X252 @ X76))=(upt @ zero_zero_nat @ X76)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_94_upt__append)). 0.47/0.69 thf(conj_0, hypothesis, (ord_less_eq_nat @ m @ n), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)). 0.47/0.69 thf(c_0_5, plain, ![X1451:nat, X1452:nat > a]:(((listIn84854903take_a @ X1451 @ X1452)=(map_nat_a @ X1452 @ (upt @ zero_zero_nat @ X1451)))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_24_i__take__def])])). 0.47/0.69 thf(c_0_6, plain, ![X1496:nat > a, X1497:list_nat, X1498:list_nat]:(((map_nat_a @ X1496 @ (append_nat @ X1497 @ X1498))=(append_a @ (map_nat_a @ X1496 @ X1497) @ (map_nat_a @ X1496 @ X1498)))), inference(variable_rename,[status(thm)],[fact_4_map__append])). 0.47/0.69 thf(c_0_7, plain, ![X1623:nat, X1624:nat > a]:(((listIn84854903take_a @ X1623 @ X1624)=(map_nat_a @ X1624 @ (upt @ zero_zero_nat @ X1623)))), inference(variable_rename,[status(thm)],[c_0_5])). 0.47/0.69 thf(c_0_8, negated_conjecture, ((append_a @ (listIn84854903take_a @ m @ f) @ (map_nat_a @ f @ (upt @ m @ n)))!=(listIn84854903take_a @ n @ f)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_1])])). 0.47/0.69 thf(c_0_9, plain, ![X1:nat > a, X11:list_nat, X12:list_nat]:(((map_nat_a @ X1 @ (append_nat @ X11 @ X12))=(append_a @ (map_nat_a @ X1 @ X11) @ (map_nat_a @ X1 @ X12)))), inference(split_conjunct,[status(thm)],[c_0_6])). 0.47/0.69 thf(c_0_10, plain, ![X1:nat > a, X5:nat]:(((listIn84854903take_a @ X5 @ X1)=(map_nat_a @ X1 @ (upt @ zero_zero_nat @ X5)))), inference(split_conjunct,[status(thm)],[c_0_7])). 0.47/0.69 thf(c_0_11, negated_conjecture, ((append_a @ (listIn84854903take_a @ m @ f) @ (map_nat_a @ f @ (upt @ m @ n)))!=(listIn84854903take_a @ n @ f)), inference(split_conjunct,[status(thm)],[c_0_8])). 0.47/0.69 thf(c_0_12, plain, ![X1:nat > a, X5:nat, X11:list_nat]:(((append_a @ (listIn84854903take_a @ X5 @ X1) @ (map_nat_a @ X1 @ X11))=(map_nat_a @ X1 @ (append_nat @ (upt @ zero_zero_nat @ X5) @ X11)))), inference(spm,[status(thm)],[c_0_9, c_0_10])). 0.47/0.69 thf(c_0_13, plain, ![X1870:nat, X1871:nat]:((~(ord_less_eq_nat @ X1870 @ X1871)|((append_nat @ (upt @ zero_zero_nat @ X1870) @ (upt @ X1870 @ X1871))=(upt @ zero_zero_nat @ X1871)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_94_upt__append])])). 0.47/0.69 thf(c_0_14, negated_conjecture, ((map_nat_a @ f @ (append_nat @ (upt @ zero_zero_nat @ m) @ (upt @ m @ n)))!=(listIn84854903take_a @ n @ f)), inference(rw,[status(thm)],[c_0_11, c_0_12])). 0.47/0.69 thf(c_0_15, plain, ![X5:nat, X32:nat]:((((append_nat @ (upt @ zero_zero_nat @ X5) @ (upt @ X5 @ X32))=(upt @ zero_zero_nat @ X32))|~((ord_less_eq_nat @ X5 @ X32)))), inference(split_conjunct,[status(thm)],[c_0_13])). 0.47/0.69 thf(c_0_16, hypothesis, (ord_less_eq_nat @ m @ n), inference(split_conjunct,[status(thm)],[conj_0])). 0.47/0.69 thf(c_0_17, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_10]), c_0_16])]), ['proof']). 0.47/0.69 # SZS output end CNFRefutation 0.47/0.69 # Parsed axioms : 400 0.47/0.69 # Removed by relevancy pruning/SinE : 0 0.47/0.69 # Initial clauses : 742 0.47/0.69 # Removed in clause preprocessing : 72 0.47/0.69 # Initial clauses in saturation : 670 0.47/0.69 # Processed clauses : 1783 0.47/0.69 # ...of these trivial : 56 0.47/0.69 # ...subsumed : 869 0.47/0.69 # ...remaining for further processing : 858 0.47/0.69 # Other redundant clauses eliminated : 335 0.47/0.69 # Clauses deleted for lack of memory : 0 0.47/0.69 # Backward-subsumed : 17 0.47/0.69 # Backward-rewritten : 4 0.47/0.69 # Generated clauses : 5651 0.47/0.69 # ...of the previous two non-redundant : 4598 0.47/0.69 # ...aggressively subsumed : 0 0.47/0.69 # Contextual simplify-reflections : 3 0.47/0.69 # Paramodulations : 5293 0.47/0.69 # Factorizations : 8 0.47/0.69 # NegExts : 0 0.47/0.69 # Equation resolutions : 356 0.47/0.69 # Propositional unsat checks : 0 0.47/0.69 # Propositional check models : 0 0.47/0.69 # Propositional check unsatisfiable : 0 0.47/0.69 # Propositional clauses : 0 0.47/0.69 # Propositional clauses after purity: 0 0.47/0.69 # Propositional unsat core size : 0 0.47/0.69 # Propositional preprocessing time : 0.000 0.47/0.69 # Propositional encoding time : 0.000 0.47/0.69 # Propositional solver time : 0.000 0.47/0.69 # Success case prop preproc time : 0.000 0.47/0.69 # Success case prop encoding time : 0.000 0.47/0.69 # Success case prop solver time : 0.000 0.47/0.69 # Current number of processed clauses : 430 0.47/0.69 # Positive orientable unit clauses : 87 0.47/0.69 # Positive unorientable unit clauses: 6 0.47/0.69 # Negative unit clauses : 11 0.47/0.69 # Non-unit-clauses : 326 0.47/0.69 # Current number of unprocessed clauses: 3756 0.47/0.69 # ...number of literals in the above : 10500 0.47/0.69 # Current number of archived formulas : 0 0.47/0.69 # Current number of archived clauses : 310 0.47/0.69 # Clause-clause subsumption calls (NU) : 49862 0.47/0.69 # Rec. Clause-clause subsumption calls : 34860 0.47/0.69 # Non-unit clause-clause subsumptions : 711 0.47/0.69 # Unit Clause-clause subsumption calls : 781 0.47/0.69 # Rewrite failures with RHS unbound : 0 0.47/0.69 # BW rewrite match attempts : 102 0.47/0.69 # BW rewrite match successes : 72 0.47/0.69 # Condensation attempts : 0 0.47/0.69 # Condensation successes : 0 0.47/0.69 # Termbank termtop insertions : 102510 0.47/0.69 0.47/0.69 # ------------------------------------------------- 0.47/0.69 # User time : 0.187 s 0.47/0.69 # System time : 0.015 s 0.47/0.69 # Total time : 0.202 s 0.47/0.69 # Maximum resident set size: 4720 pages 0.47/0.69 0.47/0.69 # ------------------------------------------------- 0.47/0.69 # User time : 0.199 s 0.47/0.69 # System time : 0.017 s 0.47/0.69 # Total time : 0.216 s 0.47/0.69 # Maximum resident set size: 2404 pages 0.47/0.69 EOF